Codes with few weights arising from linear sets
نویسندگان
چکیده
In this article we present a class of codes with few weights arising from special type linear sets. We explicitly show the such codes, their weight enumerators and possible choices for generator matrices. particular, our construction yields three and, in some cases, almost MDS codes. The interest these relies on applications to authentication secret schemes, connections further objects as association schemes graphs.
منابع مشابه
Linear codes with few weights from inhomogeneous quadratic functions
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field GF(p), where p is an odd prime. They include some earlier li...
متن کاملSeveral Classes of $p$-ary Linear Codes with Few Weights
Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...
متن کاملLinear codes and weights
Let F be a finite field with q elements. A k dimensional subspace C of the vector space Fn of all n-tuples over F is called a linear code of length n and dimension k. Algebraically, C is just a k-dimensional vector space over F. However, as a particular subspace of Fn, C inherits some metric properties. Specifically, for every v E Fn, the weight of v, denoted by wt( v), is defined to be the num...
متن کاملOn the complete weight enumerators of some linear codes with a few weights
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of linear codes are important research topics. In this paper, we consider some classes of linear codes with a few weights and determine the complete weight enumera...
متن کاملLinear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$
In this paper, we construct an infinite family of five-weight codes from trace codes over the ring R = F2+uF2, where u 2 = 0. The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by using character sums. Combined with Pless power moments and Newton’s Identities, the weight distribution of the Gray image of trace codes was present. Their support structure i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2023
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2020129